Strong equilibria in games with the lexicographical improvement property
نویسندگان
چکیده
We study a class of finite strategic games with the property that every deviation of a coalition of players that is profitable to each of its members strictly decreases the lexicographical order of a certain function defined on the set of strategy profiles. We call this property the lexicographical improvement property (LIP) and show that, in finite games, it is equivalent to the existence of a generalized strong potential function. We use this characterization to derive existence, efficiency and fairness properties of strong equilibria (SE). As our main result, we show that an important class of games that we call bottleneck congestion games has the LIP and thus the abovementioned properties. For infinite games, the LIP does neither imply the existence of a generalized strong potential nor the existence of SE. We therefore introduce the slightly more general concept of the pairwise LIP and prove that whenever the pairwise LIP is satisfied for a continuous function, then there exists a SE. As a consequence, we show that splittable bottleneck congestion games with continuous facility cost functions possess a SE. An extended abstract of this paper appeared in the Proceedings of the 3rd Workshop on Internet and Networks Economics. Research supported by the Federal Ministry of Education and Research (BMBF grant 03MOPAI1) and by the Deutsche Forschungsgemeinschaft within the research training group ‘Methods for Discrete Structures’ (GRK 1408). T. Harks School of Business and Economics, Maastricht University, Tongersestraat 53, 6211 LM Maastricht, The Netherlands e-mail: [email protected] M. Klimm (B) · R. H. Möhring Institut fürMathematik, Technische Universität Berlin, Straße des 17. Juni 136, 10623 Berlin, Germany e-mail: [email protected] R. H. Möhring e-mail: [email protected]
منابع مشابه
Strong Nash Equilibria in Games with the Lexicographical Improvement Property
We introduce a class of finite strategic games with the property that every deviation of a coalition of players that is profitable to each of its members strictly decreases the lexicographical order of a certain function defined on the set of strategy profiles. We call this property the Lexicographical Improvement Property (LIP) and show that it implies the existence of a generalized strong ord...
متن کاملOn Strong Equilibria and Improvement Dynamics in Network Creation Games
We study strong equilibria in network creation games. These form a classical and well-studied class of games where a set of players form a network by buying edges to their neighbors at a cost of a fixed parameter α. The cost of a player is defined to be the cost of the bought edges plus the sum of distances to all the players in the resulting graph. We identify and characterize various structur...
متن کاملEfficient Equilibria in Polymatrix Coordination Games
We consider polymatrix coordination games with individual preferences where every player corresponds to a node in a graph who plays with each neighbor a separate bimatrix game with non-negative symmetric payoffs. In this paper, we study α-approximate k-equilibria of these games, i.e., outcomes where no group of at most k players can deviate such that each member increases his payoff by at least...
متن کاملComputing Pure Nash and Strong Equilibria in Bottleneck Congestion Games
Bottleneck congestion games properly model the properties of many real-world network routing applications. They are known to possess strong equilibria – a strengthening of Nash equilibrium to resilience against coalitional deviations. In this paper, we study the computational complexity of pure Nash and strong equilibria in these games. We provide a generic centralized algorithm to compute stro...
متن کاملOn the Existence of Strong Nash Equilibria
This paper investigates the existence of strong Nash equilibria (SNE) in continuous and concave games. We show that the coalition consistence property introduced in the paper, together with the concavity and continuity of payoffs, permits the existence of strong Nash equilibria in games with compact and convex strategy spaces. The coalition consistency property is a general condition that canno...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Int. J. Game Theory
دوره 42 شماره
صفحات -
تاریخ انتشار 2013